Secret Sharing and Proactive Renewal of Shares in Hierarchical Groups

نویسندگان

  • Ruchira Naskar
  • Indranil Sengupta
چکیده

Secret sharing in user hierarchy represents a challenging area for research. Although a lot of work has already been done in this direction, this paper presents a novel approach to share a secret among a hierarchy of users while overcoming the limitations of the already existing mechanisms. Our work is based on traditional (k+ 1, n)-threshold secret sharing, which is secure as long as an adversary can compromise not more than k secret shares. But in real life it is often feasible for an adversary to obtain more than k shares over a long period of time. So, in our work we also present a way to overcome this vulnerability, while implementing our hierarchical secret sharing scheme. The use of Elliptic Curve Cryptography makes the computations easier and faster in our work.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Strong Proactive Verifiable Secret Sharing Scheme with Unconditional Security

In secret sharing scheme, the master secret and all the private shares (which are distributed by the dealer to the shareholders) are the two secrets which are to be maintained confidentially. In all the secret sharing schemes proposed till date, private shares are reused to reconstruct the master secret. But we proposed a new way of Proactive Secret Sharing Scheme in which, instead of renewing ...

متن کامل

Practical Share Renewal for Large Amounts of Data

Threshold secret sharing schemes encode data into several shares such that a threshold number of shares can be used to recover the data. Such schemes provide confidentiality of stored data without using encryption, thus avoiding the problems associated with key management. To provide long-term confidentiality, proactive secret sharing techniques can be used, where shares are refreshed or renewe...

متن کامل

Submitted in Partial Fulfillment of the Requirements for the Degree Of

Verifiable secret sharing is a cryptographic primitive used in many distributed applications. To engineer realistic applications, it is beneficial to have dynamically changing shares and shareholder groups. Proactive secret sharing schemes deal with dynamically changing shares. Secret redistribution schemes solve issues of both dynamically changing shares and shareholder groups. In this dissert...

متن کامل

On Secret Sharing Schemes with Extended Capabilities

Secret sharing allows split control over the secret. Secret parts known as secret shares are distributed to different shareholders (locations). Secret can be recovered upon combination of sufficient number of shares. Research into theoretical foundations, development of widespread applications, as well as, new attacks resulted in great need for extra features of existing schemes. We describe ex...

متن کامل

Computationally secure multiple secret sharing: models, schemes, and formal security analysis

A multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants. in such a way a multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants, such that any authorized subset of participants can reconstruct the secrets. Up to now, existing MSSs either require too long shares for participants to be perfect secur...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1006.1192  شماره 

صفحات  -

تاریخ انتشار 2010